Competing with Markov prediction strategies
نویسنده
چکیده
Assuming that the loss function is convex in the prediction, we construct a prediction strategy universal for the class of Markov prediction strategies, not necessarily continuous. Allowing randomization, we remove the requirement of convexity.
منابع مشابه
Evaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملParametric Estimation in a Recurrent Competing Risks Model
A resource-efficient approach to making inferences about the distributional properties of the failure times in a competing risks setting is presented. Efficiency is gained by observing recurrences of the compet- ing risks over a random monitoring period. The resulting model is called the recurrent competing risks model (RCRM) and is coupled with two repair strategies whenever the system fails. ...
متن کاملThe relationship between transformational and transactional leadership styles with conflict management strategies among Iran futsal pro-leagues coaches
Conflict Management is a leadership interpersonal skill. Using proper leadership styles can lead to effective conflict management. This research aims to study the relationship between transformational and transactional leadership in Bass model (1985) with conflict management strategies in Iran futsal pro-leagues coaches. Coaches leadership style and conflict management strategies were measured ...
متن کاملLand use Change Prediction using CA-Markov modeling (Case Study: Eshtehard)
This article has no abstract.
متن کاملA comparison of reversible jump MCMC algorithms for DNA sequence segmentation using hidden Markov models
This paper describes a Bayesian approach to determining the number of hidden states in a hidden Markov model (HMM) via reversible jump Markov chain Monte Carlo (MCMC) methods. Acceptance rates for these algorithms can be quite low, resulting in slow exploration of the posterior distribution. We consider a variety of reversible jump strategies which allow inferences to be made in discretely obse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0607136 شماره
صفحات -
تاریخ انتشار 2006